Interval conjectures for level Hilbert functions

Tate Conjectures for Hilbert Modular Surfaces

Numerical Hilbert functions for Macaulay2

The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used with floating point arithmetic over the complex numbers. They provide a viable alternative in this setting to purely symbolic methods such as standard bases. ...

SYZYGIES and HILBERT FUNCTIONS

Throughout k stands for a field. For simplicity, we assume that k is algebraically closed and has characteristic 0. However, many of the open problems and conjectures make sense without these assumptions. The polynomial ring S = k[x1, . . . , xn] is graded by deg(xi) = 1 for all i. A polynomial f is homogeneous if f ∈ Si for some i, that is, if all monomial terms of f have the same degree. An i...

Bounds on Hilbert Functions

This thesis is constituted of two articles, both related to Hilbert functions and h-vectors. In the first paper, we deal with h-vectors of reduced zero-dimensional schemes in the projective plane, and, in particular, with the problem of finding the possible h-vectors for the union of two sets of points of given h-vectors. In the second paper, we generalize the Green’s Hyperplane Restriction The...

Cones of Hilbert Functions

We study the closed convex hull of various collections of Hilbert functions. Working over a standard graded polynomial ring with modules that are generated in degree zero, we describe the supporting hyperplanes and extreme rays for the cones generated by the Hilbert functions of all modules, all modules with bounded a-invariant, and all modules with bounded Castelnuovo–Mumford regularity. The f...